A hop-count based positioning algorithm for wireless ad-hoc networks

We propose a range-free localization algorithm for a wireless ad-hoc network utilizing the hopcount metric’s ability to indicate proximity to anchors (i.e., nodes with known positions). In traditional sense, hop-count generally means the number of intermediate routers a datagram has to go through between its source and the destination node. We analytically show that hop-count could be used to indicate proximity relative to an anchor node. Our proposed algorithm is computationally feasible for resource constrained wireless ad-hoc nodes, and gives reasonable accuracy. We perform both real experiments and simulations to evaluate the algorithm’s performance. Experimental results show that our algorithm outperforms similar proximity based algorithms utilizing Received Signal Strength (RSS) and Expected Transmission Count (ETX). We also analyze the impact of various parameters like the number of anchor nodes, placements of anchor nodes and varying transmission powers of the nodes on the hop-count based localization algorithm’s performance through simulation.